On the Symmetric Property of Homogeneous Boolean Functions
نویسندگان
چکیده
We use combinatorial methods and permutation groups to classify homogeneous boolean functions. The property of symmetry of a boolean function limits the size of the function’s class. We exhaustively searched for all boolean functions on V6. We found two interesting classes of degree 3 homogeneous boolean functions: the first class is degree 3 homogeneous bent boolean functions; and the second is degree 3 homogeneous balanced boolean functions. Both the bent and balanced functions discovered have nice algebraic and combinatorial structures. We note that some structures can be extended to a large boolean space. The application of homogeneous boolean functions for fast implementation on parallel architectures is mooted.
منابع مشابه
On the conjecture about the nonexistence of rotation symmetric bent functions
In this paper, we describe a different approach to the proof of the nonexistence of homogeneous rotation symmetric bent functions. As a result, we obtain some new results which support the conjecture made in this journal, i.e., there are no homogeneous rotation symmetric bent functions of degree > 2. Also we characterize homogeneous degree 2 rotation symmetric bent functions by using GCD of pol...
متن کاملOn the nonexistence of homogeneous rotation symmetric bent Boolean functions of degree greater than two
In this paper we present a result towards the conjectured nonexistence of homogeneous rotation symmetric bent functions having degree > 2.
متن کاملRotation Symmetric Bent Boolean Functions for n = 2p
It has been conjectured that there are no homogeneous rotation symmetric bent Boolean functions of degree greater than two. In this paper we begin by proving that sums of short-cycle rotation symmetric bent Boolean functions must contain a specific degree two monomial rotation symmetric Boolean function. We then prove most cases of the conjecture in n=2p, p>2 prime, variables and extend this wo...
متن کاملFuzzy number-valued fuzzy relation
It is well known fact that binary relations are generalized mathematical functions. Contrary to functions from domain to range, binary relations may assign to each element of domain two or more elements of range. Some basic operations on functions such as the inverse and composition are applicable to binary relations as well. Depending on the domain or range or both are fuzzy value fuzzy set, i...
متن کاملFilter theory in MTL-algebras based on Uni-soft property
The notion of (Boolean) uni-soft filters in MTL-algebras is introduced, and several properties of them are investigated. Characterizations of (Boolean) uni-soft filters are discussed, and some (necessary and sufficient) conditions for a uni-soft filter to be Boolean are provided. The condensational property for a Boolean uni-soft filter is established.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999